🧮 Theoretical Computer Science - matmat · Scour

My theoretical computer science notes from Epsilon Camp 🎯Performance Proofs

scottaaronson.blog·4d·

Abstract Semantic Graph 🔢Denotational Semantics

en.wikipedia.org·1d·Hacker News·

Issue 518 🔗Functional Compilers

haskellweekly.news·10h·

🐍 Functionally Zen 🧬Functional Programming

testdouble.com·1h·

On the Complexity of Determinations 🎯Performance Proofs

arxiv.org·2d·

Fragments: April 2 🔗Concatenative Programming

martinfowler.com·19h·

When a Good Theory meets a Bad Idealization: The Failure of the Thermodynamics of Computation ⚛️Information Physics

sites.pitt.edu·6d·Hacker News·

Optimizing for Understanding 🔗Topological Sorting

blog.br11k.dev·22h·Hacker News·

Computer Science Notes 💻CS

klatz.co·1d·

The Lisp Curse 🧠Lisp Dialects

winestockwebdesign.com·1d·

The Synthesis Problem: Why I’m Building a New Logic Toolchain ⚙️Logic Synthesis

llama.gs·6d·Hacker News·

The Computer Science Fetish 🛠Language Design

mail.cyberneticforests.com·4d·Hacker News·

How to Build an ML Framework in Rust, from Scratch, in a Weekend 🦀Rust Borrowing

erikkaum.com·4d·Hacker News·

Quadratic Micropass Type Inference 🔍Type Inference

articles.luminalang.com·6d·Hacker News·

Algo P\"art: An Algorithmic Reconstruction of Arvo P\"art's Summa 🎯Performance Proofs

arxiv.org·2d·

'AI' and Computer Science: Contradictions Emerge between Ideologies 🌍Cultural Algorithms

arxiv.org·1d·

A Graded Modal Dependent Type Theory with Erasure, Formalized 🔠Type-Level Programming

arxiv.org·1d·

On Representability of Multiple-Valued Functions by Linear Lambda Terms Typed with Second-order Polymorphic Type System λLambda Formalization

arxiv.org·6d·

Kakeya Conjecture and Conditional Kolmogorov Complexity 🧮Kolmogorov Complexity

arxiv.org·6d·

Structure, Analysis, and Synthesis of First-Order Algorithms 🎯Performance Proofs

arxiv.org·6d·

Loading more...